The constructive Radon-Nikodým theorem

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Reformulation of the Radon-nikodym Theorem

The Radon-Nikodym theorems of Segal and Zaanen are principally concerned with the classification of those measures p. for which any X« p. is given in the form

متن کامل

New versions of the Radon-Nikodým theorem

On the basis of recent developments in measure theory the present note obtains a few new versions of the classical Radon-Nikodým theorem, with the aim to combine simple formulations with wide domains of application. 0. Introduction After Fremlin [4] section 232 the Radon-Nikodým (=:RN) theorem must be on any list of the half-dozen most important theorems of measure theory. Yet there is a lack o...

متن کامل

On the Maximum Theorem: A Constructive Analysis

We examine the maximum theorem by Berge from the point of view of Bishop style constructive mathematics. We will show an approximate version of the maximum theorem and the maximum theorem for functions with sequentially locally at most one maximum. Keywords—Maximum theorem, Constructive mathematics, Sequentially locally at most one maximum.

متن کامل

The Vitali covering theorem in constructive mathematics

This paper investigates the Vitali Covering Theorem from various constructive angles. A Vitali Cover of a metric space is a cover such that for every point there exists an arbitrarily small element of the cover containing this point. The Vitali Covering Theorem now states, that for any Vitali Cover one can find a finite family of pairwise disjoint sets in the Vitali Cover that cover the entire ...

متن کامل

Matrix-based Constructive Theorem Proving

Formal methods for program verification, optimization, and synthesis rely on complex mathematical proofs, which often involve reasoning about computations. Because of that there is no single automated proof procedure that can handle all the reasoning problems occurring during a program derivation or verification. Instead, one usually relies on proof assistants like NuPRL (Constable et al., 1986...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 1977

ISSN: 0030-8730,0030-8730

DOI: 10.2140/pjm.1977.70.51